Trust And Distrust Across Coalitions - Shapley Value Centrality Measures For Signed Networks
نویسندگان
چکیده
Signed social networks are social networks with edges indicative of both trust and distrust. We propose novel game theoretic centrality measures for signed networks, which first generalize degree-based centrality from nodes to sets, and then compute individual node centralities using the concept of Shapley Value. We derive closed form expressions for the Shapley Value for most of these measures. Moreover, we demonstrate that some of these measures give improved AP (average precision) compared to net positive in-degree for the task of detecting troll users, in the Slashdot signed network.
منابع مشابه
Trust and Distrust Across Coalitions: Shapley Value Based Centrality Measures for Signed Networks (Student Abstract Version)
We propose Shapley Value based centrality measures for signed social networks. We also demonstrate that they lead to improved precision for the troll detection task.
متن کاملHow good is the Shapley value-based approach to the influence maximization problem?
This paper studies the process of information diffusion over a network, where new nodes as time passes become “informed” (or equivalently, influenced or infected), and a related problem of influence maximization that concerns finding the set of initial nodes that will lead to the most widespread effect of diffusion in the network [4, 6]. Influence maximization is an NP-hard problem [4], and the...
متن کاملfinding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory
In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...
متن کاملInterplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality
We study network centrality based on dynamic influence propagation models in social networks. To illustrate our integrated mathematical-algorithmic approach for understanding the fundamental interplay between dynamic influence processes and static network structures, we focus on two basic centrality measures: (a) Single Node Influence (SNI) centrality, which measures each node’s significance by...
متن کاملA formal analysis of trust and distrust relationships in Shakespeare’s Othello
In settings where agents can be exploited, trust and reputation are key issues. As a consequence, within the multi-agent systems community, considerable research has gone into the development of computationally viable models of these concepts. In this paper, we present an abstract framework that allows agents to form coalitions with agents that they believe to be trustworthy. In contrast to man...
متن کامل